SPEA-Based Method for MCDM Convex Integer Problems
نویسندگان
چکیده
This paper presents a method, based on the Strength Pareto Evolutionary Algorithm (SPEA), designed to solve multi-objective convex integer optimization problems. The proposed method has the aim to overcome some shortcomings of SPEA, as noted in [2]. An interaction phase with the Decision Maker (DM) is also included in the method, so that the search process can be quickly directed to the part of the search space, where the location of a desired non-dominated solution is expected. In this manner good convergence of the method is ensured.
منابع مشابه
A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملA Novel Method for Selecting the Supplier Based on Association Rule Mining
One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
متن کاملA Fuzzy TOPSIS Method Based on Left and Right Scores
Multiple criteria decision making (MCDM) problem is one of the famous different kinds of decision making problems. In more cases in real situations, determining the exact values for MCDM problems is difficult or impossible. So, the values of alternatives with respect to the criteria or / and the values of criteria weights, are considered as fuzzy values (fuzzy numbers). In such conditions, th...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملNon-Gaussian belief space planning as a convex program
Many robotics problems are challenging because it is necessary to estimate state based on noisy or incomplete measurements. In these partially observable control problems, the system must act in order to gain information while attempting to maximize the probability of achieving task goals. Recently, there has been an effort to solve partially observable problems by planning in belief space, the...
متن کامل